On checkable codes in group algebras
نویسندگان
چکیده
We classify, in terms of the structure finite group G, all algebras KG for which right ideals are annihilators principal left ideals. This means language coding theory that we classify code-checkable have been considered so far only abelian groups G. Optimality checkable codes and asymptotic results discussed.
منابع مشابه
Checkable Codes from Group Rings
Abstract—We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a codecheckable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two c...
متن کاملProbabilistically Checkable Proofs and Codes
NP is the complexity class of problems for which it is easy to check that a solution is correct. In contrast, finding solutions to certain NP problems is widely believed to be hard. The canonical example is the sat problem: given a Boolean formula, it is notoriously difficult to come up with a satisfying assignment, whereas given a proposed assignment it is trivial to plug in the values and ver...
متن کاملCode–checkable group rings
A code over a group ring is defined to be a submodule of that group ring. For a code C over a group ring RG, C is said to be checkable if there is v ∈ RG such that C = {x ∈ RG : xv = 0}. In [6], Jitman et al. introduced the notion of code-checkable group ring. We say that a group ring RG is code-checkable if every ideal in RG is a checkable code. In their paper, Jitman et al. gave a necessary a...
متن کاملPons, Reed-muller Codes, and Group Algebras
In this work we develop the family of Prometheus orthonormal sets (PONS) in the framework of certain abelian group algebras. Classical PONS, considered in 1991 by J. S. Byrnes, turned out to be a rediscovery of the 1960 construction by G. R. Welti [28], and of subsequent rediscoveries by other authors as well. This construction highlights the fundamental role played by group characters in the t...
متن کاملG-equivalence in group algebras and minimal abelian codes
Let G be a finite abelian group and F a field such that char(F) 6 | |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I1 and I2 of FG are G-equivalent if there exists an automorphism ψ of G whose linear extension to FG maps I1 onto I2. In this paper we give a necessary and sufficient condition for minimal abelian codes to be G-equivalent a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2021
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s0219498822501250